- optimized machine code
- Вычислительная техника: оптимизированный машинный код
Универсальный англо-русский словарь. Академик.ру. 2011.
optimized machine code
Смотреть что такое "optimized machine code" в других словарях:
X-machine — The X machine ( XM ) is a theoretical model of computation introduced by Samuel Eilenberg in 1974.S. Eilenberg (1974) Automata, Languages and Machines, Vol. A . Academic Press, London.] The X in X machine represents the fundamental data type on… … Wikipedia
Optimized Systems Software — Former type Software Company Fate Merged Predecessor Shepardson Microsystems Successor ICD Founded 1981 Founder(s) … Wikipedia
p-code machine — In computer programming, a p code machine, or portable code machine[citation needed] is a virtual machine designed to execute p code (the assembly language of a hypothetical CPU). This term is applied both generically to all such machines (such… … Wikipedia
G-code — G Code, or preparatory code or function, are functions in the Numerical control programming language. The G codes are the codes that position the tool and do the actual work, as opposed to M codes, that manages the machine; T for tool related… … Wikipedia
Spaghetti code — is a pejorative term for source code which has a complex and tangled control structure, especially one using many GOTOs, exceptions, threads, or other unstructured branching constructs. It is named such because program flow tends to look like a… … Wikipedia
Categorical abstract machine — (CAM) is the model of computation of a program [ Cousineau G., Curien P. L., Mauny M. The categorical abstract machine. LNCS, 201, Functional programming languages computer architecture. 1985, pp. 50 64.] , which preserves the abilities of… … Wikipedia
Dalvik virtual machine — The Dalvik virtual machine is a register based virtual machine, designed and written by Dan Bornstein with contributions from other Google engineers as part of the Android mobile phone platform. [citeweb|title=What is Android?|url=… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Lisp machine — Lisp machines were general purpose computers designed (usually through hardware support) to efficiently run Lisp as their main software language. In a sense, they were the first commercial single user workstations. Despite being modest in number… … Wikipedia
Forth (programming language) — infobox programming language name = Forth paradigm = Procedural, stack oriented year = 1970s designer = Charles H. Moore typing = typeless dialects = colorForth, Open Firmware implementations = Forth, Inc., GNU Forth, MPE influenced by =… … Wikipedia
Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing … Wikipedia
